package leecode.findmiddle;

public class Main {
    public static void main(String[] args) {
        Solution solution = new Solution();
        solution.init();
        solution.findAllPath();
        System.out.println();
        System.out.println("层序遍历结果");
        solution.levelOrder();
        System.out.println("前序迭代");
        solution.dieDai();
    }
}
